A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
نویسندگان
چکیده
We show that if a graph admits packing and covering both consisting of ? many spanning trees, where is some infinite cardinal, then the also decomposition into trees. For finite analogous question remains open, however, slightly weaker statement proved.
منابع مشابه
A Cantor-Bernstein Theorem for Paths in Graphs
As every vertex of this graph has one “outgoing” and at most one “incoming” edge, each of those components is a cycle or an infinite path. In each of these paths and cycles we now select every other edge to mark the desired bijection. The Cantor-Bernstein problem, rephrased as above for graphs, has a natural generalization to paths. Let G be any graph, and let A and B be disjoint sets of vertic...
متن کاملCantor-bernstein Theorem for Lattices
This paper is a continuation of a previous author’s article; the result is now extended to the case when the lattice under consideration need not have the least element.
متن کاملCantor-Bernstein theorem for pseudo BCK-algebras
For any σ-complete Boolean algebras A and B, if A is isomorphic to [0, b] ⊆ B and B is isomorphic to [0, a] ⊆ A, then A B. Recently, several generalizations of this known CantorBernstein type theorem for MV-algebras, (pseudo) effect algebras and `-groups have appeared in [1], [2], [4] and [5]. We prove an analogous result for certain pseudo BCK-algebras—a noncommutative extension of BCK-algebra...
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملCSM25 - The Cantor-Schröder-Bernstein Theorem
Given two finite sets, questions about the existence of different types of functions between these two sets are easy to solve, as there are finitely many such functions and so one many simply enumerate them. Further more, if one has two injective functions then it is intuitively obvious that both such functions are bijections (although not necessarily the inverses of each other). However, when ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2021
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2021.01.004